Algorithms for Transposition Invariant String Mat hing ( Extended
نویسندگان
چکیده
منابع مشابه
Transposition Invariant String Mat hing ⋆
Veli Mäkinen a,1, Gonzalo Navarro b,2, and Esko Ukkonen a,1 aDepartment of Computer S ien e, P.O Box 26 (Teollisuuskatu 23), FIN-00014 University of Helsinki, Finland. bCenter for Web Resear h, Department of Computer S ien e, University of Chile Blan o En alada 2120, Santiago, Chile. Abstra t Given strings A = a1a2 . . . am and B = b1b2 . . . bn over an alphabet Σ ⊆ U, where U is some numeri al...
متن کاملMat hing Numeri Strings under Noise
Abstra t. Numeri string is a sequen e of symbols from an alphabet U, where U is some numeri al universe losed under addition and subtra tion. Given two numeri strings A = a 1 a m and B = b 1 b n and a distan e fun tion d(A;B) that gives the s ore of the best (partial) mat hing of A and B, the transposition invariant distan e is min t2U fd(A + t; B)g, where A + t = (a 1 + t)(a 2 + t) : : : (a m ...
متن کاملMatching Numeric Strings under Noise
Abstra t. Numeri string is a sequen e of symbols from an alphabet U, where U is some numeri al universe losed under addition and subtra tion. Given two numeri strings A = a 1 a m and B = b 1 b n and a distan e fun tion d(A;B) that gives the s ore of the best (partial) mat hing of A and B, the transposition invariant distan e is min t2U fd(A + t; B)g, where A + t = (a 1 + t)(a 2 + t) : : : (a m ...
متن کاملFlexible Musi Retrieval in Sublinear Time
Abstra t. Musi sequen es an be treated as texts in order to perform musi retrieval tasks on them. However, the text sear h problems that result from this modeling are unique to musi retrieval. Up to date, several approa hes derived from lassi al string mat hing have been proposed to ope with the new sear h problems, yet ea h problem had its own algorithms. In this paper we show that a te hnique...
متن کاملForward - Fast - Sear h : Another Fast Variant of the Boyer - Moore String Mat
Abstra t. We present a variation of the Fast-Sear h string mat hing algorithm, a re ent member of the large family of Boyer-Moore-like algorithms, and we ompare it with some of the most e e tive string mat hing algorithms, su h as Horspool, Qui k Sear h, Tuned Boyer-Moore, Reverse Fa tor, Berry-Ravindran, and Fast-Sear h itself. All algorithms are ompared in terms of run-time e ien y, number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008